Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
نویسندگان
چکیده
Distributed bandit online convex optimization with time-varying coupled inequality constraints is considered, motivated by a repeated game between group of learners and an adversary. The attempt to minimize sequence global loss functions at the same time satisfy constraint functions, where are across distributed each round. sum local respectively, which adaptively generated revealed in manner, i.e., only values sampling instance, function held privately learner. Both one- two-point feedback studied two corresponding algorithms used learners. We show that sublinear expected regret violation achieved these algorithms, if accumulated variation comparator also grows sublinearly. In particular, we $\mathcal {O}(T^{\theta })$ static {O}(T^{7/4-\theta one-point setting, {O}(T^{\max \lbrace \kappa,1-\kappa \rbrace {O}(T^{1-\kappa /2})$ notation="LaTeX">$\theta \in (3/4,5/6]$ notation="LaTeX">$\kappa (0,1)$ user-defined tradeoff parameters. Finally, tightness theoretical results illustrated numerical simulations simple power grid example, compares proposed existing literature.
منابع مشابه
Distributed Convex Optimization with Inequality Constraints over Time-varying Unbalanced Digraphs
This paper considers a distributed convex optimization problem with inequality constraints over time-varying unbalanced digraphs, where the cost function is a sum of local objectives, and each node of the graph only knows its local objective and inequality constraints. Although there is a vast literature on distributed optimization, most of them require the graph to be balanced, which is quite ...
متن کاملDistributed Convex Optimization with Many Convex Constraints
We address the problem of solving convex optimization problems with many convex constraints in a distributed setting. Our approach is based on an extension of the alternating direction method of multipliers (ADMM) that recently gained a lot of attention in the Big Data context. Although it has been invented decades ago, ADMM so far can be applied only to unconstrained problems and problems with...
متن کاملContinuous-time Distributed Convex Optimization with Set Constraints ⋆
We study a distributed convex optimization problem with set constraints. The objective function is a summation of strictly convex functions. Based on a multi-agent system formulation, we consider that each node is with continuous-time dynamics and can only access its local objective function. Meanwhile, each node is subject to a common convex set constraint. The nodes can exchange local informa...
متن کاملOnline Convex Optimization with Stochastic Constraints
This paper considers online convex optimization (OCO) with stochastic constraints, which generalizes Zinkevich’s OCO over a known simple fixed set by introducing multiple stochastic functional constraints that are i.i.d. generated at each round and are disclosed to the decision maker only after the decision is made. This formulation arises naturally when decisions are restricted by stochastic e...
متن کاملTime-Varying Gaussian Process Bandit Optimization
We consider the sequential Bayesian op-timization problem with bandit feedback,adopting a formulation that allows for the re-ward function to vary with time. We modelthe reward function using a Gaussian pro-cess whose evolution obeys a simple Markovmodel. We introduce two natural extensionsof the classical Gaussian process upper confi-dence bound (GP-UCB) algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2021
ISSN: ['0018-9286', '1558-2523', '2334-3303']
DOI: https://doi.org/10.1109/tac.2020.3030883